MAXBRIDGE Maximise the bridges - CodeChef Solution


Graph Medium

Python Code:

total_input=int(input())
for _ in range(total_input):
    n,e=map(int,input().split())
    g={n:[]}
    for i in range(1,n):
        g[i]=[i+1]
        print(i,i+1)
        e-=1
    end=3
    while e>0:
        for i in range(1,end):
            
            if g[i][-1]<end:
                g[i].append(end)
                print(i,end)
                e-=1
                if e==0:break

        end+=1
    


Comments

Submit
0 Comments
More Questions

149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks